Tracking design changes with formal machine-checked proof

Tracking Design Changes with Formal Machine - Checked Proof

Designs are often modi ed for use in new circumstances. If formal proof is to be an acceptable veri cation methodology for industry, it must be capable of tracking design changes quickly. We describe our experiences formally verifying an implementation of an ATM network component, and on our subsequent veri cation of modi ed designs. Three of the designs veri ed are in use in a working network....

Tracking Design Changes with Formal Verification

Designs are often modiied for use in new circumstances. If formal proof is to be an acceptable veriication methodology for industry , it must be capable of tracking design changes quickly. We describe our experiences formally verifying an implementation of an ATM network component, and on our subsequent veriication of modiied designs. Three of the designs veriied are in use in a working network...

How to Believe a Machine-Checked Proof

Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization

K eyw ord s: verification, theorem proving, cyclic scheduling, sim ulation, PVS 1 In tr o d u ctio n Form al m ethods provide the kind of rigor in software engineering th a t is needed to move the software developm ent process to a level com parably to o ther engi­ neering professions. There are m any kinds of formal m ethods th a t can be employed a t different stages of the developm ent proce...

A Machine-Checked Proof of A State-Space Construction Algorithm

This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mutually-recursive pair of procedures that compute a series of non-trivial, nested local fixed point...